首页> 外文OA文献 >An LDPCC decoding algorithm based on Bowman-Levin approximation --Comparison with BP and CCCP--
【2h】

An LDPCC decoding algorithm based on Bowman-Levin approximation --Comparison with BP and CCCP--

机译:一种基于Bowman-Levin近似的LDpCC译码算法    - 与Bp和CCCp比较 -

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Belief propagation (BP) and the concave convex procedure (CCCP) are bothmethods that utilize the Bethe free energy as a cost function and solveinformation processing tasks. We have developed a new algorithm that also usesthe Bethe free energy, but changes the roles of the master variables and theslave variables. This is called the Bowman-Levin (BL) approximation in thedomain of statistical physics. When we applied the BL algorithm to decode theGallager ensemble of short-length regular low-density parity check codes(LDPCC) over an additive white Gaussian noise (AWGN) channel, its averageperformance was somewhat better than that of either BP or CCCP. This impliesthat the BL algorithm can also be successfully applied to other problems towhich BP or CCCP has already been applied.
机译:信念传播(BP)和凹凸过程(CCCP)都是利用Bethe自由能作为成本函数并解决信息处理任务的方法。我们已经开发了一种新算法,该算法也使用Bethe自由能,但是改变了主变量和从变量的作用。在统计物理学领域中,这被称为鲍曼-莱文(BL)近似。当我们将BL算法应用于加性高斯白噪声(AWGN)通道上的短长度常规低密度奇偶校验码(LDPCC)的Gallager集合解码时,其平均性能比BP或CCCP的平均性能要好一些。这意味着BL算法也可以成功地应用于已经应用BP或CCCP的其他问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号